Higher-Order Automated Theorem Proving for Natural Language Semantics
نویسندگان
چکیده
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order unii-cation (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
منابع مشابه
Higher - Order Automated Theorem Proving for NaturalLanguage
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کاملAutomated Reasoning for Computational Semantics
This paper discusses inference in computational semantics. We argue that state-of-the-art methods in rst-order theorem proving and model building are of direct relevance to inference for natural language processing. We support our claim by discussing the inferen-tial aspects of several higher discourse phenomena and reporting on an experiment where the induced deduction problems are solved by t...
متن کاملHigher{order Coloured Uniication and Natural Language Semantics
In this paper, we show that Higher{Order Coloured Uniication { a form of uniication developed for automated theorem proving { provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)'s analys...
متن کاملHigher-Order Coloured Unification and Natural Language Semantics
In this paper, we show that Higher–Order Coloured Unification – a form of unification developed for automated theorem proving – provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)’s anal...
متن کاملInference and Computational Semantics
This paper discusses inference in computational semantics. We argue that state-of-the-art methods in first-order theorem proving and model generation are of direct relevance to inference for natural language processing. We support our claim by discussing our implementation of van der Sandt’s presupposition projection algorithm in Discourse Representation Theory, an approach which demands sustai...
متن کامل